Parsing Graphs with Hyperedge Replacement Grammars
نویسندگان
چکیده
Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has potential applications in natural language understanding and generation. A recognition algorithm due to Lautemann is known to be polynomial-time for graphs that are connected and of bounded degree. We present a more precise characterization of the algorithm’s complexity, an optimization analogous to binarization of contextfree grammars, and some important implementation details, resulting in an algorithm that is practical for natural-language applications. The algorithm is part of Bolinas, a new software toolkit for HRG processing.
منابع مشابه
Hyperedge Replacement and Nonprojective Dependency Structures
Synchronous Hyperedge Replacement Graph Grammars (SHRG) can be used to translate between strings and graphs. In this paper, we study the capacity of these grammars to create non-projective dependency graphs. As an example, we use languages that contain cross serial dependencies. Lexicalized hyperedge replacement grammars can derive string languages (as path graphs) that contain an arbitrary num...
متن کاملBetween a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars
Motivated by applications in natural language processing, we study the uniform membership problem for hyperedge-replacement grammars that generate directed acyclic graphs. Our major result is a lowdegree polynomial-time algorithm that solves the uniform membership problem for a restricted type of such grammars. We motivate the necessity of the restrictions by two different NP-completeness results.
متن کاملPredictive Shift-Reduce Parsing for Hyperedge Replacement Grammars
Graph languages defined by hyperedge replacement grammars can be NP-complete. We study predictive shift-reduce (PSR) parsing for a subclass of these grammars, which generalizes the concepts of SLR(1) string parsing to graphs. PSR parsers run in linear space and time. In comparison to the predictive top-down (PTD) parsers recently developed by the authors, PSR parsing is more efficient and more ...
متن کاملSeveral Aspects of Context Freeness for Hyperedge Replacement Grammars
In this paper we survey several aspects related to normal forms of hyperedge replacement grammars. Considering context free hyperedge replacement grammars we introduce, inspired by string grammars, Chomsky Normal Form and Greibach Normal Form. The algorithm of conversion is quite the same with the algorithm for string grammars. The important difference is related to the fact that hyperedge gram...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کامل